Normalization and axiomatization for numerical dependencies

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Definition and Axiomatization of Inclusion Dependencies for XML

Die Forschungsberichte der Institute für Wirtschaftsinformatik dienen der Darstellung vorläufiger Ergebnisse z. B. Projektberichte und Zwischenergebnisse, die i. d. R. für spätere Veröffentlichungen überarbeitet werden. Die Autoren sind für kritische Hinweise dankbar. Alle Rechte vorbehalten. Research reports comprise preliminary results, e.g. project reports and intermediary results which will...

متن کامل

A Finite Axiomatization of Conditional Independence and Inclusion Dependencies

We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the unrestricted implication problem for inclusion, functional, and embedded multivalued dependencies in the unirelational case.

متن کامل

A Complete Axiomatization of Full Acyclic Join Dependencies

A sound and complete formal system for full acyclic join dependencies is obtained by adding three derivation rules to the axioms of multivalued dependencies. 0 1998 Elsevier Science B.V. All rights reserved.

متن کامل

A Numerical Criterion for Simultaneous Normalization

We investigate conditions for simultaneous normalizability of a family of reduced schemes, i.e., the normalization of the total space normalizes, fiber by fiber, each member of the family. The main result (under more general conditions) is that a flat family of reduced equidimensional projective C-varieties (Xy)y∈Y with normal parameter space Y—algebraic or analytic—admits a simultaneous normal...

متن کامل

Efficient derivation of numerical dependencies

Numerical dependencies (NDs) are database constraints that limit the number of distinct Y -values that can appear together with any X-value, where both X and Y are sets of attributes in a relation schema. While it is known that NDs are not finitely axiomatizable, there is no study on how to efficiently derive NDs using a set of sound (yet necessarily incomplete) rules. In this paper, after prov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1985

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(85)80017-6